Search results for "Heterogeneous random walk in one dimension"

Quantum Random Walks – New Method for Designing Quantum Algorithms

2008

Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on "glued trees" graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications.

Avoiding Boundary Effects in Wang-Landau Sampling

2003

A simple modification of the ``Wang-Landau sampling'' algorithm removes the systematic error that occurs at the boundary of the range of energy over which the random walk takes place in the original algorithm.

One-Dimensional Diffusion

2009

Random walk networks

2004

Abstract Random Boolean networks are among the best-known systems used to model genetic networks. They show an on–off dynamics and it is easy to obtain analytical results with them. Unfortunately very few genes are strictly on–off switched. On the other hand, continuous methods are in principle more suitable to capture the real behavior of the genome, but have difficulties when trying to obtain analytical results. In this work, we introduce a new model of random discrete network: random walk networks, where the state of each gene is changed by small discrete variations, being thus a natural bridge between discrete and continuous models.

Random Walk and Diffusion

2014

The concept of random walk as introduced by Einstein is introduced. It is shown that a random walk on a lattice can be descrbed by a difference equation, which becomes a partial differential equation (diffusion equation) in the continuum limit. The equation is solved with the help of Fourier and Laplace transformations.